recursion theorem造句

The second recursion theorem can be applied to any total recursive function.
The second part of the first recursion theorem follows from the first part.
To apply the first recursion theorem, the recursion equations must first be recast as a recursive operator.
A classic example using the second recursion theorem is the function Q ( x, y ) = x.
Quines are possible in any Turing complete programming language, as a direct consequence of Kleene's recursion theorem.
It's difficult to find recursion theorem in a sentence. 用recursion theorem造句挺难的

Like the second recursion theorem, the first recursion theorem can be used to obtain functions satisfying systems of recursion equations.
Like the second recursion theorem, the first recursion theorem can be used to obtain functions satisfying systems of recursion equations.
The same definition of recursive function can be given, in computability theory, by applying Kleene's recursion theorem.
Compared to the second recursion theorem, the first recursion theorem produces a stronger conclusion but only when narrower hypotheses are satisfied.
Compared to the second recursion theorem, the first recursion theorem produces a stronger conclusion but only when narrower hypotheses are satisfied.
A second difference is that the first recursion theorem only applies to systems of equations that can be recast as recursive operators.
The proof of part 1 of the first recursion theorem is obtained by iterating the enumeration operator & Phi; beginning with the empty set.
By the corollary to the recursion theorem, there is an index e such that \ phi _ e ( y ) returns Q ( e, y ).
A number of mathematical concepts are named after him : Kleene hierarchy, Kleene algebra, the Kleene star ( Kleene closure ), Kleene's recursion theorem and the Kleene fixpoint theorem.
Rogers [ 1967 ] uses the term "'weak recursion theorem "'for the first recursion theorem and "'strong recursion theorem "'for the second recursion theorem.

更多例句：下一页